Denotational Semantics for Teaching Lazy Functional Programming
نویسنده
چکیده
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, France.
منابع مشابه
Axiomatic Constructor Classes in Isabelle/HOLCF
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with their laws, and implemented state and resumption monad transformers as generic constructor class instances. This is a step towards our goal of giving modular denotational semantics for concurrent lazy functional programm...
متن کاملFunctional concepts in C++
We describe a parser-translator program that translates typed λ-terms into C++ classes so as to integrate functional concepts. We prove the correctness of the translation of λ-terms into C++ with respect to a denotational semantics using Kripke-style logical relations. We introduce a general technique for introducing lazy evaluation into C++, and illustrate it by carrying out in C++ the example...
متن کاملMixed Lazy/Strict Graph Semantics
Explicitly enforcing strictness is often used by functional programmers as an important tool for making applications fit time and space efficiency requirements. Few functional programmers however, are familiar with the consequences of explicitly enforcing strictness for formal reasoning about their programs. Some “folklore” knowledge has emerged but this is based on experience rather than on ri...
متن کاملFixed Points in Metrified Quasi Ordered Sets: Modelling Escaping in Functional Programs
The standard denotational semantics of a programming language, being based on Tarski’s Theorem, is often not capable of expressing program properties. Annotated semantic domains and corresponding semantic functions capacitate us to express the properties, but the resulting structures may no longer be partially ordered sets. Instead we obtain quasi ordered sets, which lack the antisymmetry of pa...
متن کاملThe Derivation of Functional Equivalents of Imperative Programs
Denotational semantics is presented as a valuable theoretical tool, having many applications including language design, compiler generation and program analysis. In particular, a method is described for deriving a concise and useful functional representation of a program using a denotational definition of the source language’s semantics. Our aim is to translate a given program into a compact fu...
متن کامل